Solving systems of nonlinear matrix equations involving Lipshitzian mappings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Jacobi Operational Matrix Approach for Solving Systems of Linear and Nonlinear Integro-Differential Equations

‎‎‎‎‎‎‎‎‎‎‎‎‎This paper aims to construct a general formulation for the shifted Jacobi operational matrices of integration and product‎. ‎The main aim is to generalize the Jacobi integral and product operational matrices to the solving system of Fredholm and Volterra integro--differential equations‎ which appear in various fields of science such as physics and engineering. ‎The Operational matr...

متن کامل

Solving systems of nonlinear equations using decomposition technique

A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...

متن کامل

solving systems of nonlinear equations using decomposition technique

a systematic way is presented for the construction of multi-step iterative method with frozen jacobian. the inclusion of an auxiliary function is discussed. the presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of newton multi-step method. the auxiliary function provides us the way to overcome the singul...

متن کامل

Solving discrete systems of nonlinear equations

In this paper we study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice Z of the n-dimensional Euclidean space IR. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that every vertex is an element of Z and each simplex of the triangulation lies in an n-d...

متن کامل

An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations

‎In this paper‎, ‎an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed‎. ‎The convergence analysis of the algorithm is investigated‎. ‎We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions‎. ‎Finally‎, ‎some numerical examples are given to demons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fixed Point Theory and Applications

سال: 2011

ISSN: 1687-1812

DOI: 10.1186/1687-1812-2011-89